Automated Static and Dynamic Obstacle Avoidance in Arbitrary 3D Polygonal Worlds
نویسنده
چکیده
In common applications, a robot will have no prior knowledge of its environment and must use sensory information to build a cognitive model for path and route finding. The process of building a good cognitive model from sensory information alone is complex and time consuming. Uncertainty of the input data can also cause the resulting paths and routes to be suboptimal or erroneous. In many of these applications, however, it is possible to augment a robot's sensory information with existing static information about the environment.
منابع مشابه
A* PATH PLANNING FOR SECOND LIFE Obstacle Avoidance in Dynamic Virtual Worlds
3D Virtual Worlds are becoming a new popular medium for a vast variety of so-called “serious games” applications. These serious games tackle problems like education, commerce, tourism etc. and exploit the notion of environment together with participant immersion within this environment in order to provide better user experience. Second Life is currently one the most popular and powerful Virtual...
متن کاملDynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملTime To Contact for Obstacle Avoidance
Time to Contact (TTC) is a biologically inspired method for obstacle detection and reactive control of motion that does not require scene reconstruction or 3D depth estimation. TTC is a measure of distance expressed in time units. Our results show that TTC can be used to provide reactive obstacle avoidance for local navigation. In this paper we describe the principles of time to contact and sho...
متن کاملA Navigation System for Autonomous Robot Operating in Unknown and Dynamic Environment: Escaping Algorithm
In this study, the problem of navigation in dynamic and unknown environment is investigated and a navigation method based on force field approach is suggested. It is assumed that the robot performs navigation in...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کامل